PENJADWALAN 20 JOB 8 MESIN DENGAN METODE GENETIC ALGORITHM (GA)
نویسندگان
چکیده
منابع مشابه
A Job-shop Scheduling Problem (jssp) Using Genetic Algorithm (ga)
The job-shop scheduling (JSS) is a schedule planning for low volume systems with many variations in requirements. In job-shop scheduling problem (JSSP) environment, there are j jobs to be processed on m machines with a certain objective function to be minimized. JSSP with j jobs to be processed on more than two machines have been classified as a combinatorial problem. They cannot be formulated ...
متن کاملKlasifikasi Data Cardiotocography Dengan Integrasi Metode Neural Network Dan Particle Swarm Optimization
Backpropagation (BP) adalah sebuah metode yang digunakan dalam training Neural Network (NN) untuk menentukan parameter bobot yang sesuai. Proses penentuan parameter bobot dengan menggunakan metode backpropagation sangat dipengaruhi oleh pemilihan nilai learning rate (LR)-nya. Penggunaan nilai learning rate yang kurang optimal berdampak pada waktu komputasi yang lama atau akurasi klasifikasi yan...
متن کاملGenetic Algorithm (GA)-Based Inclinometer Layout Optimization
This paper presents numerical simulation results of an airflow inclinometer with sensitivity studies and thermal optimization of the printed circuit board (PCB) layout for an airflow inclinometer based on a genetic algorithm (GA). Due to the working principle of the gas sensor, the changes of the ambient temperature may cause dramatic voltage drifts of sensors. Therefore, eliminating the influe...
متن کاملA Genetic Algorithm for Job-Shop Scheduling
In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also desig...
متن کاملJob Shop Scheduling Using Genetic Algorithm
Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new algorithm for the job s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SPEKTRUM INDUSTRI
سال: 2013
ISSN: 2442-2630,1693-6590
DOI: 10.12928/si.v11i2.1660